/* SSH2 Library - Diffie-Hellman.cc
 * Copyright (c) 2009 The Consola Authors
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 * 
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 * 
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 * THE SOFTWARE.
 * 
 */
#include "SSH2/StdAfx.h"
#include <cmath>

/**
 * IsPrime. Determine if the number is a prime number.
 *
 * @param number    Number to determine if its prime or not.
 *
 * @return false    Not a prime number.
 * @return true     Is a prime number.
 */
bool IsPrime(const int number)
{
    /* The numbers 1 and 0 are not a prime numbers, and neither is any 
     * negative number; at least in the truest sense. */
    if (number <= 1)
        return false;

    /* Convert the number to a double, and find the square root. */
    double n = sqrt(static_cast<double>(number));

    for (int i = 2; i <= n; i++) {
        if (number % i == 0)
            return false;
    }

    return true;
}


/* EOF */

